Location:
Search - TSP in c
Search list
Description:
Platform: |
Size: 222208 |
Author: yangyang |
Hits:
Description: The source code of Travelling Salesman Problem. Implement in Visual C++.
Platform: |
Size: 121856 |
Author: jantima |
Hits:
Description: 在matlab的环境下,利用ANT_COLONY算法求解TSP问题,灵活,精练,是你参考学习的好M文件-In the matlab environment, the use of TSP problem algorithm ANT_COLONY, flexible, concise, is that you learn a good reference document M
Platform: |
Size: 2048 |
Author: 王上 |
Hits:
Description: 模拟退火算法的另一种实现方法，解决TSP问题。代码写的很精炼。-Simulated Annealing Algorithm Another method to solve TSP problems. Code written in a very refined.
Platform: |
Size: 118784 |
Author: DR |
Hits:
Description: 详细讲述模拟退火算法的理论原理。并TSP问题为例进行讲解，并各处多种语言的源代码，包括c，matlab以及delphi。
-Simulated annealing algorithm described in detail the theory of principle. And TSP as an example to explain the problem and the source code of various languages, including c, matlab, as well as delphi.
Platform: |
Size: 25600 |
Author: lian |
Hits:
Description: 在Visual C++ 编译环境下，遗传算法的程序，并利用它们求解了48个城市的TSP问题。-In Visual C++ compiler environment, the genetic algorithm procedure, and use them to solve a 48 cities TSP problem.
Platform: |
Size: 730112 |
Author: 肖翔 |
Hits:
Description: 在Visual C++ 编译环境下， 模拟退火算法算法的程序，并利用它们求解了48个城市的TSP问题。-In Visual C++ compiler environment, simulated annealing algorithm algorithm procedures and use them to solve the 48 cities TSP problem.
Platform: |
Size: 691200 |
Author: 肖翔 |
Hits:
Description: 《智能优化算法》课的作业，用遗传算法解TSP问题。其间遇到了收敛速度慢的问题，也是在这个网找到了解决方案。大家下载的应该都是那个VC6的Windows程序。我这个是从零开始写的，大家看起来应该容易懂些。C++的Console程序，VC2005下编译。全部用STL，所以旧的编译器可能会有点问题。压缩包内有谢胜利的论文：《TSP遗传算法的改进》。正是用他的贪婪交配才使得10代左右解就收敛到很好。再次赞一下！-" Intelligent Optimization Algorithms" course work, with the issue of Genetic Algorithm for TSP. Which encountered the problem of slow convergence is also found in the network solution. We should all download the Windows program that VC6. I wrote this from scratch, we should look more easy to understand. C++ the Console program, VC2005 compiled under. All use of STL, the compiler is why the old might be a problem. Compressed packet, there are papers to thank the victory: " TSP to improve the genetic algorithm." It is mating with his greed makes on behalf of about 10 on the convergence to good solutions. Praise again!
Platform: |
Size: 599040 |
Author: |
Hits:
Description: 一个较好的蚁群MATLAB程序，附地图。-In this M-file, the implemention of ACO Algorithm is given with the support of reference papers listed. You can easily use it as following command to see the pictures of result and the iterative playing course.
Platform: |
Size: 27648 |
Author: boy |
Hits:
Description: 模拟退火和对称
*欧几里德旅行商问题。
*
*为基础的解决办法的本地搜索启发式
*非过境道路和近邻
-/*
* Simulated annealing and the Symetric
* Euclidian Traveling Salesman Problem.
*
* Solution based on local search heuristics for
* non-crossing paths and nearest neighbors
*
* Storage Requirements: n^2+4n ints
*
* Problem: given the coordinates of n cities in the plane, find a
* permutation pi_1, pi_2, ..., pi_n of 1, 2, ..., n that minimizes
* sum for 1<=i<n D(pi_i,pi_i+1), where D(i,j) is the euclidian
* distance between cities i and j
*
* Note: with n cities, there is (n-1)!/2 possible tours.
* factorial(10)=3628800 factorial(50)=3E+64 factorial(150)=5.7E+262
* If we could check one tour per clock cycle on a 100 MHZ computer, we
* would still need to wait approximately 10^236 times the age of the
* universe to explore all tours for 150 cities.
*
* gcc-O4-o tsp tsp.c-lm tsp | ghostview-
*
* Usage: tsp [-v] [n=dd] [s=dd] [filename]
* -v : verbose
* n= : nb of cities (cities generated randomly on E^2
Platform: |
Size: 86016 |
Author: 孙博 |
Hits:
Description: 使用C++ 实现的，利用动态规划算解决旅行商问题-solving TSP problem with dynamic programming in C++
Platform: |
Size: 18432 |
Author: EA |
Hits:
Description: 这是用c#编写的求解TSP的普通遗传算法-It is written in c# genetic algorithm for solving TSP
Platform: |
Size: 7168 |
Author: 卓越 |
Hits:
Description: 回溯法解决01背包问题，是在标准C++上运行的代码，故在VC++上也能运行良好！-Backtracking to solve 01 knapsack problem is in the standard C++ code to run on, so the VC++ is also able to run well!
Platform: |
Size: 1024 |
Author: daisy |
Hits:
Description: 一个蚁群算法求解邮递员路由问题（TSP）具体实现，本人在传统蚁群算法基础上进行改进，达到较高的效率-An ant colony algorithm for routing problem postman (TSP) concrete implementation, I am in the traditional ant colony algorithm based on the improvements to achieve higher efficiency
Platform: |
Size: 291840 |
Author: wangrenbiao |
Hits:
Description: 在Visual C++ 编译环境下，遗传算法的程序，并利用它们求解了48个城市的TSP问题。-In the Visual C++ compiler environment, the genetic algorithm process, and use them to solve a 48 cities TSP problem.
Platform: |
Size: 731136 |
Author: wjw |
Hits:
Description: 自己的作业。用C++编写的蚁群算法求解TSP最优路径的问题。-Their own operations. Written in C++, ant colony algorithm for optimal path for solving TSP problems.
Platform: |
Size: 3072 |
Author: 萧茅律 |
Hits:
Description: 外国人写的求解traveling salesman problem (TSP)
和some related network optimization problems的算法合集-Concorde is a computer code for the traveling salesman problem (TSP)
and some related network optimization problems. The code is written
in the ANSI C programming language and it is available for academic
research use
Platform: |
Size: 753664 |
Author: 王鹏 |
Hits:
Description: C#下基于遗传算法做的TSP程序，很好用！-TSP Solution Base on GA in CSharp Language
Platform: |
Size: 393216 |
Author: paul |
Hits:
Description: 退火问题在c++语言条件解决tsp问题，是转载的，可以参考参考-Anneal conditions in c++ language to solve tsp issue is reproduced, and can refer to the reference
Platform: |
Size: 1024 |
Author: 郭文 |
Hits:
Description: 本文首先提出了基于TSP 的多点位加工路径优化模型以最高生产效率为目标
函数并以数控中心的多孔位加工和多点位焊接两个典型的自动化加工系统为例来
验证该模型的经济性和适用性其次分别为这两个系统建立了基于TSP 的路径优
化模型模型中考虑了实际加工时的系统中约束条件的影响如数控加工中心的换
刀速度主轴移动速度和焊接机器人的工作台转动速度等提出了近似法将数
控加工中心主轴对同一个孔位n 次重复遍历如钻粗镗精镗等简化对n 个
极小间距的相邻点位的一次遍历从而建立相应的多点位数控加工模型然后分
析和比较了罚函数法Tabu 算法等算法这些算法在求解TSP 时存在收敛速度慢
运算过程复杂的不足本文结合了这些算法的一些特点采用了改进的Hopfield 算
法求解基于TSP 的路径优化模型用C 语言编制了该改进算法的优化程序经实例
试算表明该算法具有收敛快权系数变化小迭代次数少的特点-Firstly, multi-point manufacture routine optimum model is referred. The highest
efficient is the object function. Multi-holes machining and multi-weld system are adapted
to verify the economics and adaptability of model. Secondly, separately the routine
optimum models of both systems are built up. Restriction in the real systems is considered
(such as the tool change speed, staple shaft moving speed in CNC and operation platform
rotation speed in weld robot). The approximate way is referred to predigest the n times
visits as 1 times visit, to establish the multi-holes CNC machining model. Thirdly, analyze
and compare the characters and difference of penalty function, Tabu algorithms, point out
their faults combine with the merits of other algorithms, and adapt the improving Hopfield
algorithms calculate the routine optimum model based on TSP, which is speedily and
easily calculated. The optimum program is compiled in C language to achieve the
improving algorithms.
Platform: |
Size: 523264 |
Author: 翁經堯 |
Hits: